Computing specific isolating neighborhoods
نویسنده
چکیده
A major challenge in applying the Conley index theory to a given dynamical system is to find isolating neighborhoods of the invariant sets of interest. In this paper we describe a computational method which allows for the efficient construction of isolating neighborhoods. As an example we compute an isolating neighborhood of a heteroclinic orbit connecting a fixed point to a period two point in the Hénon map.
منابع مشابه
Isolating Neighborhoods and Chaos
We show that the map part of the discrete Conley index carries information which can be used to detect the existence of connections in the repeller-attractor decomposition of an isolated invariant set of a homeomorphism. We use this information to provide a characterization of invariant sets which admit a semi-conjugacy onto the space of sequences on K symbols with dynamics given by a subshift....
متن کاملMatching based very large-scale neighborhoods for parallel machine scheduling
In this paper we study very large-scale neighborhoods for the minimum total weighted completion time problem on parallel machines, which is known to be strongly NP-hard. We develop two different ideas leading to very large-scale neighborhoods in which the best improving neighbor can be determined by calculating a weighted matching. The first neighborhood is introduced in a general fashion using...
متن کاملAn Analytical Study in Connectivity of Neighborhoods for Single Round Robin Tournaments
Sport scheduling is a trending research topic in operations research. Local search heuristics are among the most effective methods to construct schedules. Prior studies have investigated the connectivity of existing neighborhoods in the scheduling of single round robin tournaments and determined that they are strongly affected by how the initial schedule is constructed. In this paper we prove t...
متن کاملHOODS: finding context-specific neighborhoods of proteins, chemicals and diseases
Clustering algorithms are often used to find groups relevant in a specific context; however, they are not informed about this context. We present a simple algorithm, HOODS, which identifies context-specific neighborhoods of entities from a similarity matrix and a list of entities specifying the context. We illustrate its applicability by finding disease-specific neighborhoods of functionally as...
متن کاملCOMPUTING THE PRODUCTS OF CONJUGACY CLASSES FOR SPECIFIC FINITE GROUPS
Suppose $G$ is a finite group, $A$ and $B$ are conjugacy classes of $G$ and $eta(AB)$ denotes the number of conjugacy classes contained in $AB$. The set of all $eta(AB)$ such that $A, B$ run over conjugacy classes of $G$ is denoted by $eta(G)$.The aim of this paper is to compute $eta(G)$, $G in { D_{2n}, T_{4n}, U_{6n}, V_{8n}, SD_{8n}}$ or $G$ is a decomposable group of order $2pq$, a group of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001